Abstraction Beyond a ‘Law of Thought’: On Space, Appropriation and Concrete Abstraction
نویسندگان
چکیده
منابع مشابه
PANDA: Simultaneous Predicate Abstraction and Concrete Execution
We present a new verification algorithm, PANDA, that combines predicate abstraction with concrete execution and dynamic analysis. Both the concrete and abstract state spaces of an input program are traversed simultaneously, guiding each other through on-the-fly mutual interaction. PANDA performs dynamic on-the-fly pruning of those branches in the abstract state space that diverge from the corre...
متن کاملHeap Abstraction Beyond Context-Freeness
The aim of shape analysis is to discover precise abstractions of the reachable data structures in a program’s heap. This paper develops a shape analysis for reasoning about relational properties of data structures, such as balancedness of trees or lengths of lists. Both the concrete and the abstract domain are represented by hypergraphs. The analysis is based on user-defined indexed graph gramm...
متن کاملthe “abstraction principle” in iranian law, emphasizing on jurisprudence
“abstraction principle” means separation between two obligations incommercial instruments: underlying obligation and documentary obligationthat created by drawing these documents. the main effect of this principle isthat objections related to first obligation, cannot be claim in second; wherethere is a third party. to obtain a real and comprehensive perspective of thisprinciple in iranian law, ...
متن کاملAbstraction, Law, and Freedom in Computer Science
ION, LAW, AND FREEDOM IN COMPUTER SCIENCE TIMOTHY COLBURN AND GARY SHUTE Abstract: Laws of computer science are prescriptive in nature but can have Laws of computer science are prescriptive in nature but can have descriptive analogs in the physical sciences. Here, we describe a law of conservation of information in network programming, and various laws of computational motion (invariants) for p...
متن کاملClosed Patterns and Abstraction Beyond Lattices
Recently pattern mining has investigated closure operators in families of subsets of an attribute set that are not lattices. In particular, various authors have investigated closure operators starting from a context, in the Formal Concept Analysis (FCA) sense, in which objects are described as usual according to their relation to attributes, and in which a closed element is a maximal element of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Law and Critique
سال: 2016
ISSN: 0957-8536,1572-8617
DOI: 10.1007/s10978-016-9186-z